Eulerian path - PDFSEARCH.IO - Document Search Engine

Eulerian path
Results: 103

#	Item
31	´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:20 Eulerian path Route inspection problem Graph Matching Line graph Hamiltonian path Graph theory Planar graphs NP-complete problems
32	Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 0–0 (0) Inapproximability of Orthogonal Compaction Michael J. Bannister David Eppstein Joseph A. Simons Computer Science Department, Add to Reading List Source URL: jgaa.info Language: English - Date: 2012-03-09 04:02:51 NP-complete problems Graph coloring Topological graph theory Angular resolution Eulerian path Planar graph Graph Edge coloring Petersen graph Graph theory Mathematics Graph drawing
33	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ Joondong Kim∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:57 NP-complete problems Steiner tree problem Minimum spanning tree Eulerian path Matching Graph coloring Tree Connectivity Matroid theory Graph theory Mathematics Theoretical computer science
34	A Local-Search 2-Approximation for 2-Correlation-Clustering Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in Add to Reading List Source URL: www.mit.edu Language: English - Date: 2012-07-29 14:44:15 NP-complete problems Matroid theory Spanning tree Signed graph Graph Clique Tree Combinatorial optimization Eulerian path Graph theory Theoretical computer science Mathematics
35	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:07:19 NP-complete problems Combinatorial optimization Graph connectivity Matching Steiner tree problem Minimum spanning tree Eulerian path Route inspection problem Cut Graph theory Theoretical computer science Mathematics
36	Graphs Algorithms Lecture 18: Basic Graph Algorithms [Fa’14] Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:41:03 Graph Tree Eulerian path Adjacency list Directed graph Connected component Line graph Comparability graph Graph theory Adjacency matrix Directed acyclic graph
37	Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:08:28 Polyhedron Octahedron Eulerian path Induced path Matching Route inspection problem Line graph Edge coloring Graph theory Planar graphs NP-complete problems
38	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane∗ Oswin Aichholzer† Alexander Pilz† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Hamiltonian path Path Arrangement of lines Graph Handshaking lemma Eulerian path Graph theory Mathematics Graph connectivity
39	Design Patterns for Efficient Graph Algorithms in MapReduce Jimmy Lin and Michael Schatz University of Maryland, College Park {jimmylin,mschatz}@umd.edu Add to Reading List Source URL: www.umiacs.umd.edu Language: English - Date: 2010-08-02 09:34:23 Distributed computing architecture MapReduce Parallel computing NP-complete problems PageRank Eulerian path Graph Topological graph theory Connected component Graph theory Mathematics Theoretical computer science
40	arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-07-06 20:12:57 Matching Eulerian path Petersen graph Travelling salesman problem Graph Tree Chordal graph Hamiltonian path Planar graph Graph theory NP-complete problems Cubic graph